﻿#include<iostream>
using namespace std;
const int N = 1e6 + 10;
//创建顺序表
int a[N];//用足够大的数据来模拟顺序表
int n;//标记顺序表里面有多少个元素
int main()
{
	return 0;
}
//// 计算递归求阶乘Fac算法的空间复杂度？
//
//long long fac(int N)
//{
//	if (N == 0) return 1;
//	return fac(N - 1) * N;
//}
////#include <iostream>
////using namespace std;
////const int N = 20;
////int arr[N];
////int main()
////{
////    int n = 0;
////    cin >> n;
////    int i = 0;
////    //输⼊
////
////        for (i = 0; i < n; i++)
////            cin >> arr[i];
////    //排序
////
////        for (i = 0; i < n - 1; i++)
////        {
////            int j = 0;
////            for (j = 0; j <= n - 1 - i; j++)
////            {
////                if (arr[j] < arr[j + 1])
////                {
////                    int tmp = arr[j];
////                    arr[j] = arr[j + 1];
////                    arr[j + 1] = tmp;
////                }
////            }
////        }
////    //输出
////
////        for (i = 0; i < n; i++)
////        {
////            cout << arr[i] << endl;
////        }
////    return 0;
////}
////// ⽤递归计算N的阶乘
////long long fac(int N)
////{
////	if (N == 0) return 1;
////	return fac(N - 1) * N;
////}
////void func5(int n)
////{
////	int cnt = 1;
////	while (cnt < n)
////	{
////		cnt *= 2;
////	}
////}
//////void func4(int m, int n)
//////{
//////	for (int i = 0; i < m; i++)
//////	{
//////		for (int j = 0; j < n; j++)
//////		{
//////			printf("%d, ", i);
//////		}
//////		printf("\n");
//////	}
//////}
//////void func3(int m, int n)
//////{
//////	for (int i = 0; i < m; i++)
//////	{
//////		printf("hello\n");
//////	}
//////	for (int i = 0; i < n; i++)
//////	{
//////		printf("hello\n");
//////	}
//////}
////////#define _CRT_SECURE_NO_WARNINGS 1
////////void func2(int N)
////////{
////////	int count = 0;
////////	for (int k = 0; k < 1000; k++)
////////	{
////////		++count;
////////	}
////////	printf("%d\n", count);
////////}